An undecidability result for AGh

نویسنده

  • Stéphanie Delaune
چکیده

We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties. We are interested in the Abelian groups theory in combination with the homomorphism axiom. We show that the security problem for a bounded number of sessions (expressed by satisfiability of symbolic deductibility constraints) is undecidable, obtaining in this way the first undecidability result concerning a theory for which unification is known to be decidable [2].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stéphanie Delaune An Undecidability Result for AGh

We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties. We are interested in the Abelian groups theory in combination with the homomorphism axiom. We show th...

متن کامل

On the existence of absolutely undecidable sentences of number theory

This paper deals with the concept of absolute undecidability in mathematics. The main technical result concerns a particular sentence D expressed in the language of Peano Arithmetic. On basis of this result, it is argued that it is not possible to decideD in any “reasonable” formal theory T , under a wide definition of “reasonable”. The undecidability argument is independent of both T and its l...

متن کامل

Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational group R of Grigorchuk, Nekrashevich, and Sushchanskii has finite order. A modification of the construction gives other undecidability results about the dynamic...

متن کامل

On the Identity Problem for the Special Linear Group and the Heisenberg Group

We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the Special Linear Group following recent NP-completeness result for SL(2,Z) and the undecidability for SL(4,Z) generated by 48 matrices. In the seminal paper of Paterson in 1970, an injective morphism from pai...

متن کامل

Isolation and identification of peptidic alpha-glucosidase inhibitors derived from sardine muscle hydrolyzate.

We report here the isolation of alpha-glucosidase (AGH) inhibitory peptides derived from sardine muscle hydrolyzate, which was prepared by digestion with Bacillus licheniformis alkaline protease. As a result of reversed-phase HPLC purification, two AGH inhibitory peptides were isolated from a DEAE-Sephadex A-25 column eluate. The peptides were identified as follows: Val-Trp (IC50 = 22.6 mM) and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 368  شماره 

صفحات  -

تاریخ انتشار 2006